Algebraic geometry codes over abelian surfaces containing no absolutely irreducible curves of low genus

نویسندگان

چکیده

We provide a theoretical study of Algebraic Geometry codes constructed from abelian surfaces defined over finite fields. give general bound on their minimum distance and we investigate how this estimation can be sharpened under the assumption that surface does not contain low genus curves. This approach naturally leads us to consider Weil restrictions elliptic curves which do admit principal polarization.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Irreducible Triangulations of Low Genus Surfaces

The complete sets of irreducible triangulations are known for the orientable surfaces with genus of 0, 1, or 2 and for the nonorientable surfaces with genus of 1, 2, 3, or 4. By examining these sets we determine some of the properties of these irreducible triangulations.

متن کامل

Algebraic Geometry Codes from Castle Curves

The quality of an algebraic geometry code depends on the curve from which the code has been defined. In this paper we consider codes obtained from Castle curves, namely those whose number of rational points attains Lewittes’ bound for some rational point Q and the Weierstrass semigroup at Q is symmetric.

متن کامل

Codes from Jacobian surfaces

This paper is concerned with some Algebraic Geometry codes on Jacobians of genus 2 curves. We derive a lower bound for the minimum distance of these codes from an upper “Weil type” bound for the number of rational points on irreducible (possibly singular or non-absolutely irreducible) curves lying on an abelian surface over a finite field.

متن کامل

Geometry of Algebraic Curves

The canonical divisor on a smooth plane curve 30 6.2. More general divisors on smooth plane curves 31 6.3. The canonical divisor on a nodal plane curve 32 6.4. More general divisors on nodal plane curves 33

متن کامل

Locally recoverable codes from algebraic curves and surfaces

A locally recoverable code is a code over a finite alphabet such that the value of any single coordinate of a codeword can be recovered from the values of a small subset of other coordinates. Building on work of Barg, Tamo, and Vlăduţ, we present several constructions of locally recoverable codes from algebraic curves and surfaces.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Finite Fields and Their Applications

سال: 2021

ISSN: ['1090-2465', '1071-5797']

DOI: https://doi.org/10.1016/j.ffa.2020.101791